A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs
نویسنده
چکیده
In this paper the Wallis-Fon-Der-Flaass construction of strongly regular graphs is generalized. As a result new prolific series of strongly regular graphs are obtained. Some of them have new parameters.
منابع مشابه
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
A graph is n-e.c. (n-existentially closed) if for every pair of subsets U , W of the vertex set V of the graph such that U ∩W = / 0 and |U |+ |W | = n, there is a vertex v ∈ V − (U ∪W ) such all edges between v and U are present and no edges between v and W are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices ...
متن کاملA Distance-Regular Graph with Intersection Array (5, 4, 3, 3; 1, 1, 1, 2) Does Not Exist
We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely combinatorial and computer-free.
متن کاملNew prolific constructions of strongly regular graphs
We present a purely combinatorial construction of strongly regular graphs with geometric parameters. The construction produces hyperexponentially many graphs, and uses neither linear algebra nor groups. Among the graphs constructed, there are graphs with parameters of a generalized quadrangle GQðn 1; nþ 1Þ which further produce distance regular covers of complete graphs. In this paper we presen...
متن کاملOn the Fon-der-Flaass Interpretation of Extremal Examples for Turán’s (3,4)-problem
In 1941, Turán conjectured that the edge density of any 3-graph without independent sets on 4 vertices (Turán (3, 4)-graph) is≥ 4/9(1− o(1)), and he gave the first example witnessing this bound. Brown (1983) and Kostochka (1982) found many other examples of this density. Fon-der-Flaass (1988) presented a general construction that converts an arbitrary ~ C4-free orgraph Γ into a Turán (3, 4)-gra...
متن کاملCrooked Functions, Bent Functions, and Distance Regular Graphs
Let V and W be n-dimensional vector spaces over GF (2). A mapping Q : V →W is called crooked if it satisfies the following three properties: Q(0) = 0; Q(x) +Q(y) +Q(z) +Q(x+ y + z) 6= 0 for any three distinct x, y, z; Q(x) +Q(y) +Q(z) +Q(x+ a) +Q(y + a) +Q(z + a) 6= 0 if a 6= 0 (x, y, z arbitrary). We show that every crooked function gives rise to a distance regular graph of diameter 3 having λ...
متن کامل